Subgraph isomorphism in graph classes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subgraph Isomorphism Search in Massive Graph Databases

Subgraph isomorphism search is a basic task in querying graph data. It consists to find all embeddings of a query graph in a data graph. It is encountered in many real world applications that require the management of structural data such as bioinformatics and chemistry. However, Subgraph isomorphism search is an NPcomplete problem which is prohibitively expensive in both memory and time in mas...

متن کامل

On Graph Isomorphism for Restricted Graph Classes

Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn’t be solved by classifying it as being either NP-complete or solvable in P. Nevertheless, efficient (polynomial-time or even NC) algorithms for restricted versions of GI have been found over the last four decades. Depending on the graph class, the design and analysis of algorithms for GI use tools f...

متن کامل

Subgraph statistics in subcritical graph classes

Let H be a fixed graph and G a subcritical graph class. In this paper we show that the number of occurrences of H (as a subgraph) in a uniformly at random graph of size n in G follows a normal limiting distribution with linear expectation and variance. The main ingredient in our proof is the analytic framework developed by Drmota, Gittenberger and Morgenbesser to deal with infinite systems of f...

متن کامل

Tight Bounds for Graph Homomorphism and Subgraph Isomorphism

We prove that unless Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph G to graph H cannot be done in time |V (H)|o(|V (G)|). We also show an exponential-time reduction from Graph Homomorphism to Subgraph Isomorphism. This rules out (subject to ETH) a possibility of |V (H)|o(|V (H)|)-time algorithm deciding if graph G is a subgraph of H. For both problems o...

متن کامل

Tight Bounds for Subgraph Isomorphism and Graph Homomorphism

We prove that unless Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph G to graph H cannot be done in time |V (H)|o(|V . Combined with the reduction of Cygan, Pachocki, and Soca la, our result rules out (subject to ETH) a possibility of |V (G)|o(|V -time algorithm deciding if graph H is a subgraph of G. For both problems our lower bounds asymptotically matc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2012

ISSN: 0012-365X

DOI: 10.1016/j.disc.2012.07.010